Two-agent scheduling with rejection on a single machine
نویسندگان
چکیده
منابع مشابه
Single-Machine two-agent scheduling problems with unconstrained strategies
We address a class of deterministic scheduling problems in which two agents compete for the usage of a single machine. The agents have their own objective functions and submit in each round an arbitrary, unprocessed task from their buffer for possible selection. In each round the shorter of the two submitted tasks is chosen and processed on the machine. We consider the problems under two distin...
متن کاملMulti-agent single machine scheduling
We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job),...
متن کاملTwo-agent group scheduling with deteriorating jobs on a single machine
This paper considers the two-agent scheduling problems with deteriorating jobs and group technology on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the maximum cost of the second agent cannot exceed a given upper bound. Two agents compete to perform their respective jobs on a common single machine, and each agent has...
متن کاملScheduling with regular performance measures and optional job rejection on a single machine
We address single machine problems with optional job–rejection, studied lately in Zhang et al. (2010) and Cao et al. (2006). In these papers, the authors focus on minimizing regular performance measures, i.e., functions that are non-decreasing in the jobs completion time, subject to the constraint that the total rejection cost cannot exceed a predefined upper bound. The authors prove that the c...
متن کاملJIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2015
ISSN: 0307-904X
DOI: 10.1016/j.apm.2014.07.024